On Estimating Survival Functions Under Stochastic Order

نویسندگان

  • Juan Gallegos
  • Thien T. Nguyen
  • Gregory Schrage
چکیده

Let H̄ , Ḡ, and H̄ be survival functions satisfying the constraint F̄ ≤ H̄≤Ḡ. Lee, Yan, and Shi (1999) had developed an algorithm to estimate the survival function H̄ when F̄ and Ḡ are known. However, lacking a closed form of the estimator makes the investigations of the properties of the estimators difficult. In this paper, we propose alternative estimators for H̄ in the case where F̄ and Ḡ are known. However, lacking a closed form of the estimator makes the investigations of the properties of the estimator difficult. In this paper we propose alternative estimators for H̄ in the case where F̄ and Ḡ are known and in the case where they are unknown. The estimators are proved to be strongly uniformly consistent in both cases: the formulas for the bias and the mean squared error (MSE) are also derived. In the simulations the MSE of our estimators, when F̄and Ḡare known, are uniformly better thn that of Lee, Yan, and Shi when the sample size is small (30): when the sample size is large, further investigation is needed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation of Distribution Functions under Second Order Stochastic Dominance

The concept of stochastic ordering as introduced by Lehmann (1955) plays a major role in the theory and practice of statistics, and a large body of existing statistical work concerns itself with the problem of estimating distribution functions F and G under the constraint that F (x) ≤ G(x) for all x. Nevertheless in economic theory, the weaker concept of second order stochastic dominance plays ...

متن کامل

Estimating Stochastically Ordered Survival Functions via Geometric Programming

Many procedures have been proposed to compute the nonparametric maximum likelihood estimates (NPMLEs) of survival functions under various stochastic ordering constraints. Each of the existing procedures is applicable only to a specific type of stochastic order constraint and often hard to implement. In this paper, we describe a method for computing the NPMLEs of survival functions, based on geo...

متن کامل

Combination of Approximation and Simulation Approaches for Distribution Functions in Stochastic Networks

This paper deals with the fundamental problem of estimating the distribution function (df) of the duration of the longest path in the stochastic activity network such as PERT network. First a technique is introduced to reduce variance in Conditional Monte Carlo Sampling (CMCS). Second, based on this technique a new procedure is developed for CMCS. Third, a combined approach of simulation and ap...

متن کامل

Optimal Relief Order Quantity under Stochastic Demand and Lead-time

In this paper, a newsboy model is developed under uniformly distributed lead-time and demand that is an appropriate assumption in obtaining optimal relief inventory of humanitarian disasters. It is noteworthy that limited historical data are in hand on relief operations. Hence, analytical and approximate solutions for optimal relief order quan­tity were derived. The effect of lead-time uncertai...

متن کامل

An Optimization Model for Multi-objective Closed-loop Supply Chain Network under uncertainty: A Hybrid Fuzzy-stochastic Programming Method

In this research, we address the application of uncertaintyprogramming to design a multi-site, multi-product, multi-period,closed-loop supply chain (CLSC) network. In order to make theresults of this article more realistic, a CLSC for a case study inthe iron and steel industry has been explored. The presentedsupply chain covers three objective functions: maximization ofprofit, minimization of n...

متن کامل

Convergence of stochastic approximation algorithms under irregular conditions

We consider a class of stochastic approximation (SA) algorithms for solving a system of estimating equations. The standard condition for the convergence of the SA algorithms is that the estimating functions are locally Lipschitz continuous. Here, we show that this condition can be relaxed to the extent that the estimating functions are bounded and continuous almost everywhere. As a consequence,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005